Machine Learning and Pattern Recognition Density Estimation: Gaussians
نویسنده
چکیده
منابع مشابه
Probabilistic Visual Learning for Object Representation
We present an unsupervised technique for visual learning, which is based on density estimation in high-dimensional spaces using an eigenspace decomposition. Two types of density estimates are derived for modeling the training data: a multivariate Gaussian (for unimodal distributions) and a Mixture-of-Gaussians model (for multimodal distributions). These probability densities are then used to fo...
متن کاملExtensions to the support vector method
The Support Vector Machine (SVM) is a new technique for solving various function estimation problems. We refer to function estimation as learning, and a technique for estimating the unknown function from data as a learning machine. To construct a learning machine one requires four components: a domain (a learning problem with associated loss function), an induction principle, a set of decision ...
متن کاملSome techniques in density estimation
Density estimation is an interdisciplinary topic at the intersection of statistics, theoretical computer science and machine learning. We review some old and new techniques for bounding sample complexity of estimating densities of continuous distributions, focusing on the class of mixtures of Gaussians and its subclasses.
متن کاملUnbiased SVM Density Estimation with Application to Graphical Pattern Recognition
Classification of structured data (i.e., data that are represented as graphs) is a topic of interest in the machine learning community. This paper presents a different, simple approach to the problem of structured pattern recognition, relying on the description of graphs in terms of algebraic binary relations. Maximum-a-posteriori decision rules over relations require the estimation of class-co...
متن کاملSpectral feature projections that maximize Shannon mutual information with class labels
Determining optimal subspace projections that can maintain task-relevant information in the data is an important problem in machine learning and pattern recognition. In this paper, we propose a nonparametric nonlinear subspace projection technique that maintains class separability maximally under the Shannon mutual information (MI) criterion. Employing kernel density estimates for nonparametric...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009